Multiple access channel with common message and secrecy constraint
نویسندگان
چکیده
منابع مشابه
Multiple access channel with common message and secrecy constraint
In this paper, we study the problem of secret communication over a multiple-access channel with a common message. Here, we assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second receiver), and both of them have access to a common message which can be decoded by the two receivers. We call this setting as Multiple-Access Wiretap Channel ...
متن کاملSecrecy Sum-Rates for the Multiple-Access Wire-Tap Channel with Ergodic Block Fading
We consider a two-user multiple-access wiretap channel that undergoes ergodic block fading. In this scenario, there are two users are communicating with a base station in the presence of an eavesdropper, who has access to the communications through a multiple-access channel. We assume independent fading for each block, and that the fading process is ergodic. We also assume that the channel gain...
متن کاملAchievable Rates for the General Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy
We consider the General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed eavesdropper who is as capable as the intended receiver, but has different channel parameters. We aim to provide perfect secrecy for the transmitters in this multi-access environment. Using Gaussian co...
متن کاملIndividual secrecy of fading homogeneous multiple access wiretap channel with successive interference cancellation
We investigate individual secrecy performance in a K-user quasi-static Rayleigh fading homogeneous multiple access wiretap channel (MAC-WT), where a legitimate receiver employs successive interference cancellation (SIC) decoding. We first evaluate individual secrecy performance under an arbitrary SIC order by deriving closed-form expressions with respect to secrecy outage probability and effect...
متن کاملStrong Secrecy for Multiple Access Channels
We show strongly secret achievable rate regions for two different wiretap multiple-access channel coding problems. In the first problem, each encoder has a private message and both together have a common message to transmit. The encoders have entropy-limited access to common randomness. If no common randomness is available, then the achievable region derived here does not allow for the secret t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET Communications
سال: 2016
ISSN: 1751-8636,1751-8636
DOI: 10.1049/iet-com.2015.0468